Flexible GPBi-CG Method for Nonsymmetric Linear Systems

نویسندگان

  • Jia-Min Wang
  • Tong-Xiang Gu
چکیده

We present a flexible version of GPBi-CG algorithm which allows for the use of a different preconditioner at each step of the algorithm. In particular, a result of the flexibility of the variable preconditioner is to use any iterative method. For example, the standard GPBi-CG algorithm itself can be used as a preconditioner, as can other Krylov subspace methods or splitting methods. Numerical experiments are conducted for flexible GPBi-CG for a few matrices including some nonsymmetric matrices. These experiments illustrate the convergence and robustness of the flexible iterative method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CR Variants of Hybrid Bi-CG Methods for Solving Linear Systems with Nonsymmetric Matrices

s at ICCAM 2008 CR Variants of Hybrid Bi-CG Methods for Solving Linear Systems with Nonsymmetric Matrices Kuniyoshi Abe Gifu Shotoku University 1-38, Nakauzura, Gifu, 500-8288 Japan [email protected] Joint work with: S. Fujino By Krylov subspace methods, we are solving a large sparse linear system Ax = b, where A stand for an n-by-n matrix, and x and b are n-vectors, respectively. The Bi-C...

متن کامل

Further improvements in nonsymmetric hybrid

In the past few years new methods have been proposed that can be seen as combinations of standard Krylov subspave methods, such as Bi{ CG and GMRES. One of the rst hybrid schemes of this type is CGS, actually the Bi{CG squared method. Other such hybrid schemes include BiCGSTAB (a combination of Bi{CG and GMRES(1)), QMRS, TFQMR, Hybrid GMRES (polynomial preconditioned GMRES) and the nested GMRES...

متن کامل

Deflation and Balancing Preconditioners for Krylov Subspace Methods Applied to Nonsymmetric Matrices

For quite some times, deflation preconditioner has been proposed and used to accelerate the convergence of Krylov subspace methods. For symmetric positive definite linear systems, convergence of CG combined with deflation has been analyzed and compared with other preconditioners, e.g. with the abstract balancing preconditioner [Nabben and Vuik, SIAM J. Sci. Comput., 27 (2006), pp. 1742–1759]. I...

متن کامل

A Preconditioned MINRES Method for Nonsymmetric Toeplitz Matrices

Circulant preconditioners that cluster eigenvalues are well established for linear systems involving symmetric positive definite Toeplitz matrices. For these preconditioners rapid convergence of the preconditioned conjugate gradient method is guaranteed. Since circulant preconditioners can be applied quickly using the fast Fourier transform, preconditioned CG with circulant preconditioning is e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013